Variations on a Theme by Massey
نویسندگان
چکیده
In 1994, Jim Massey proposed the guessing entropy as a measure of difficulty that an attacker has to guess secret used in cryptographic system, and established well-known inequality between entropy. Over 15 years before, unpublished work, he also for integer-valued random variable given variance. this paper, we establish link two works by more general framework relationship discrete (absolute) continuous (differential) Two approaches are which (or Rényi entropy) can be upper bounded using differential (Rényi) some suitably chosen variable. As application, lower bounds on moments derived terms or (without side information) conditional Arimoto (when information is available).
منابع مشابه
Variations on a theme.
A ring satisfying x = x is necessarily commutative. We consider a variety of weaker forms of this condition and show that many but not all of them imply commutativity. We also present a variety of elementary proofs of the fact that x = x implies commutativity.
متن کاملThree Variations on a Theme by Collatz
The Collatz problem is reformulated in three ways as a non-arithmetic problem in first-order logic.
متن کاملVariations on a theme by Huffman
Abstruct-In honor of the twenty-fifth amdversary of Huffman coding, four new results about Huffman codes are presented. 'Ibe ffrst result shows that a binary prefix condition code is a Huffmau code iff the intermediate and terminal nodes id the code tree can be listed by nonin-creasing probabiuty so that each node in the fist is adjacent to its sibling. The second result upper bounds the redund...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3141264